|
|
Systems of Sequential Grammars Applied to Parsing
Repík, Tomáš ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis examines Grammar systems as the potentially more powerful tool for parsing as the simple grammars. The intention is to adapt theoretical models of grammar systems for parsing. New methods are introduced, with focus on determinism in order to prevent backtracking during parsing. The basis for the parser is a cooperating distributed grammar system. The implementation uses predictive, top-down parsing method, LL(1)Tables, and recursion as well. The parser is universal, usable for any LL-Grammar and for any grammar system based on them.
|
|
|
Parsing Based on Multigeneration
Kleiner, Miloš ; Čermák, Martin (referee) ; Meduna, Alexandr (advisor)
Multygeneratic system is based on cooperation action of infinity count of context-free grammars. All this context free-grammars parallel and synchronous derivate individual sentential form. During generation came in each specific derivation step to checking of correction of each generated sentential forms. This checking can be made by different ways. Solution is then so-called multistring (vector of strings), so by the help of this is defined generated language.
|
|
|
Systems of Sequential Grammars Applied to Parsing
Repík, Tomáš ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis examines Grammar systems as the potentially more powerful tool for parsing as the simple grammars. The intention is to adapt theoretical models of grammar systems for parsing. New methods are introduced, with focus on determinism in order to prevent backtracking during parsing. The basis for the parser is a cooperating distributed grammar system. The implementation uses predictive, top-down parsing method, LL(1)Tables, and recursion as well. The parser is universal, usable for any LL-Grammar and for any grammar system based on them.
|
|
|
Compiler of Language of Mathematical Function
Junek, Lukáš ; Horáček, Petr (referee) ; Čermák, Martin (advisor)
In this thesis, we are dealing with construction of Interpreter of Language of Mathematical function. We constructed all parts of interpreter, which involved processing and execution of source code. The main part of my thesis is implementation of computer operations with matrices using SSE instructions. For this purpose, we used interface by Intel. There in a special header file are defined the functions corresponding to each instruction. However, functions not only to calculate, but perform support operations, which eliminate some annoying features of assembler.
|
|
|
Parsing Based on Multigeneration
Kleiner, Miloš ; Čermák, Martin (referee) ; Meduna, Alexandr (advisor)
Multygeneratic system is based on cooperation action of infinity count of context-free grammars. All this context free-grammars parallel and synchronous derivate individual sentential form. During generation came in each specific derivation step to checking of correction of each generated sentential forms. This checking can be made by different ways. Solution is then so-called multistring (vector of strings), so by the help of this is defined generated language.
|
guest ::
